A Priority Queue with the Working-set Property
نویسنده
چکیده
A new priority queue is introduced, for which the cost to insert a new item is constant and the cost to delete the item x with the minimum value is O(log kx), where kx is the number of items that are inserted after x and are still in the heap when x is deleted. We achieve the above bounds in both the amortized case and the worst case.
منابع مشابه
Priority Queues with Multiple Time Fingers
A priority queue is presented that supports the operations insert and find-min in worst-case constant time, and delete and deletemin on element x in worst-case O(lg(min{wx, qx} + 2)) time, where wx (respectively qx) is the number of elements inserted after x (respectively before x) and are still present at the time of the deletion of x. Our priority queue then has both the working-set and the q...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کاملAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملTransient Solution of an M/M/1 Variant Working Vacation Queue with Balking
This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 17 شماره
صفحات -
تاریخ انتشار 2006